Extremal Positive Splines with Applications to Interpolation and Approximation by Generalized Convex Functions
نویسندگان
چکیده
F(s, t) = wn(s)w0(t) dtiw^) dt2w2(t2) • • • </*„__!*„_!(*„_!). Jt Jtl Jtn-2 A fundamental solution for L is given by G(s, t) = F(s, t) for s ^ t, G(s, t) = 0 for s < t. A fundamental solution for L* is GJs, i) = G(t, s). To avoid cumbersome formulations results are stated for n ^ 2 (in which case G is continuous), unless indicated otherwise. By SR(T) we mean the collection of Radon measures on the locally compact Hausdorff space T; by 9£R0CO and 9W(T) , the subfamilies of measures of compact support and of positive measures. For an open interval J let 9W(7) be the set of real functions on I possessing an nth distribution derivative belonging to 301(7), « = 1 , 2 , . . . . For n ^ 2, if u e mV) then D~u e AC(I) and D~u e BV(I). One shows that a measure u e 501(7) belongs to 9K(1) iff Lu e 5R(7) in the following weak sense: There is \x e 30?(7) such that j I?<j)(t)u{dt) = J (j)(i)ix(dt) for each <j) e CJ(7); if this is so one says \x = Lu. Let 501J(R) consist of the functions in 90?"(J?) of compact support. For any interval 7 we say u e 50loO(7) if u e $0t£(jR) and supp(w) c: 7. Each u e 50l(7) has integral representations
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملInterpolation of fuzzy data by using flat end fuzzy splines
In this paper, a new set of spline functions called ``Flat End Fuzzy Spline" is defined to interpolate given fuzzy data. Some important theorems on these splines together with their existence and uniqueness properties are discussed. Then numerical examples are presented to illustrate the differences between of using our spline and other interpolations that have been studied before.
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملOn generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملApplication of Fuzzy Bicubic Splines Interpolation for Solving Two-Dimensional Linear Fuzzy Fredholm Integral Equations
In this paper, firstly, we review approximation of fuzzy functions by fuzzy bicubic splines interpolation and present a new approach based on the two-dimensional fuzzy splines interpolation and iterative method to approximate the solution of two-dimensional linear fuzzy Fredholm integral equation (2DLFFIE). Also, we prove convergence analysis and numerical stability analysis ...
متن کامل